Maximizing the weighted number of on-time jobs in single machine scheduling with time windows
نویسندگان
چکیده
منابع مشابه
Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems
The problem of maximizing the weighted number of just-in-time jobs in a two-machine ow shop scheduling system is known to be NP-hard [4]. However, the question of whether this problem is strongly or ordinary NP-hard remains an open question. We provide a pseudo-polynomial time algorithm to solve this problem, proving that it is NP-hard in the ordinary sense. Moreover, we show how the pseudo-po...
متن کاملOn-line scheduling on a single machine: maximizing the number of early jobs
This note deals with the scheduling problem of maximizing the number of early jobs on a single machine. We investigate the on-line version of this problem in the Preemption-Restart model. This means that jobs may be preempted, but preempting results in all the work done on this job so far being lost. Thus, if the job is restarted, then it has to be done from scratch. We prove that the shortest ...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملMinimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
متن کاملMulti-agent scheduling on a single machine to minimize total weighted number of tardy jobs
We consider the feasibility model of multi-agent scheduling on a single machine, where each agent’s objective function is to minimize the total weighted number of tardy jobs. We show that the problem is strongly NP-complete in general. When the number of agents is fixed, we first show that the problem can be solved in pseudo-polynomial time for integral weights, and can be solved in polynomial ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1997
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(97)00074-5